On Exploiting Hitting Sets for Model Reconciliation

نویسندگان

چکیده

In human-aware planning, a planning agent may need to provide an explanation human user on why its plan is optimal. A popular approach do this called model reconciliation, where the tries reconcile differences in and human's such that also optimal model. paper, we present logic-based framework for reconciliation extends beyond realm of planning. More specifically, given knowledge base KB1 entailing formula phi second KB2 not it, seeks explanation, form cardinality-minimal subset KB1, whose integration into makes entailment possible. Our approach, based ideas originating context analysis inconsistencies, exploits existing hitting set duality between minimal correction sets (MCSes) unsatisfiable (MUSes) order identify appropriate explanation. However, differently from those works targeting inconsistent formulas, which assume single base, MCSes MUSes are computed over two distinct bases. We conclude our paper with empirical evaluation newly introduced instances, show how it outperforms state-of-the-art solver, generic non-planning instances recent SAT competitions, no other solver exists.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Hitting Sets for Combinatorial Shapes

We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first studied by Gopalan, Meka, Reingold, and Zuckerman (STOC 2011). These generalize many well-studied classes of tests, including symmetric functions and combinatorial rectangles. Generalizing results of Linial, Luby, Saks, and Zuckerman (Combinatorica 1997) and Rabani and Shpi...

متن کامل

Model Based Diagnosis of Multiple Observations with Implicit Hitting Sets

Model based diagnosis finds a growing range of practical applications, and significant performance-wise improvements have been achieved in recent years. Some of these improvements result from formulating the problem with maximum satisfiability (MaxSAT). Whereas recent work focuses on analyzing failing observations separately, it is also the case that in practical settings there may exist many f...

متن کامل

Independent sets and hitting sets of bicolored rectangular families

A bicolored rectangular family BRF is a collection of all axis-parallel rectangles contained in a given region Z of the plane formed by selecting a bottom-left corner from a set A and an upper-right corner from a set B. We prove that the maximum independent set and the minimum hitting set of a BRF have the same cardinality and devise polynomial time algorithms to compute both. As a direct conse...

متن کامل

Geometric Hitting Sets and Their Variants

Geometric Hitting Sets and Their Variants

متن کامل

Asymptotically Optimal Hitting Sets Against Polynomials

Our main result is an efficient construction of a hitting set generator against the class of polynomials of degree di in the i-th variable. The seed length of this generator is logD + O (̃logD). Here, logD = ∑ i log(di + 1) is a lower bound bound on the seed length of any hitting set generator against this class. Our construction is the first to achieve asymptotically optimal seed length for eve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i7.16807